Dual Barrier - Projection Methods Inlinear Programming
نویسندگان
چکیده
A surjective space transformation technique is used to convert an original dual linear programming problem with equality and inequality constraints into a problem involving only equality constraints. Continuous and discrete versions of the stable gradient projection method are applied to the reduced problem. The numerical methods involve performing inverse transformations. The convergence rate analysis for dual linear programming methods is presented. By choosing a particular exponential space-transformation function we obtain the dual aane scaling algorithm. Variants of methods which have linear local convergence are given.
منابع مشابه
Primal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کاملProjection onto a Polyhedron That Exploits
An algorithm is developed for projecting a point onto a polyhedron. The algorithm solves a dual version of the projection problem and then uses the relationship between the primal and dual to recover the projection. The techniques in the paper exploit sparsity. SpaRSA (Sparse Reconstruction by Separable Approximation) is used to approximately identify active constraints in the polyhedron, and t...
متن کاملOn Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
Interior point methods were widely used in the past in the form of barrier methods. In linear programming, the simplex method dominated, mainly due to inefficiencies of barrier methods. Interior point methods became quit popular again after 1984, when Karmarkar announced a fast polynomial-time interior method for nonlinear programming [Karmarkar, 1984]. In this section we present primal-dual in...
متن کاملPrimal - dual methods for linear programming
Many interior-point methods for linear programming are based on the properties of the logarithmic barrier function. After a preliminary discussion of the convergence of the (primal) projected Newton barrier method, three types of barrier method are analyzed. These methods may be categorized as primal, dual and primal-dual, and may be derived from the application of Newton’s method to different ...
متن کاملProjection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions
This paper presents a projection-based approach for solving conic feasibility problems. To find a point in the intersection of a cone and an affine subspace, we simply project a point onto this intersection. This projection is computed by dual algorithms operating a sequence of projections onto the cone, and generalizing the alternating projection method. We release an easy-to-use Matlab packag...
متن کامل